Axiomatisation and decidability of multi-dimensional Duration Calculus
نویسندگان
چکیده
منابع مشابه
Decidability of a Hybrid Duration Calculus
We present a logic which we call Hybrid Duration Calculus (HDC). HDC is obtained by adding the following hybrid logical machinery to the Restricted Duration Calculus (RDC): nominals, satisfaction operators, down-arrow binder, and the global modality. RDC is known to be decidable, and in this paper we show that decidability is retained when adding the hybrid logical machinery. Decidability of HD...
متن کاملCompleteness and Decidability of a Fragment of Duration Calculus with Iteration Completeness and Decidability of a Fragment of Duration Calculus with Iteration
The mission of UNU/IIST is to assist developing countries in the application and development of software technology. UNU/IIST contributes through its programmatic activities: 1. advanced development projects in which software techniques supported by tools are applied, 2. research projects in which new techniques for software development are investigated, 3. curriculum development projects in wh...
متن کاملSome Decidability Results for Duration Calculus under Synchronous Interpretation
Duration Calculus (or DC in short) presents a formal notation to specify properties of real-time systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidable. DC takes the set of real numbers to represent time. The main reason of undecidability comes fr...
متن کاملA Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus
We present a complete axiomatisation of the operator of projection onto state in the Duration Calculus (DC ) relative to validity in DC without extending constructs. Projection onto state was introduced and studied extensively in our earlier works. We first establish the completeness of a system of axioms and proof rules for the operator relative to validity in the extension of DC by neighbourh...
متن کاملA nominal axiomatisation of the lambda-calculus
The lambda-calculus is a fundamental syntax in computer science. It resists an algebraic treatment because of captureavoidance side-conditions. Nominal algebra is a logic of equality designed with formalisation of specifications involving binding in mind. In this paper we axiomatise the lambda-calculus using nominal algebra, demonstrate how proofs with these axioms reflect the informal argument...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.08.005